#define _CRT_SECURE_NO_WARNINGS

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        int left = 0, right = nums.size() - 1;

        if (target > nums[right])
            return nums.size();

        while (left < right)
        {
            int mid = (right - left) / 2 + left;

            if (nums[mid] >= target)
                right = mid;
            else
                left = mid + 1;
        }

        return right;
    }
};